On minimum sum representations for weighted voting games

نویسنده

  • Sascha Kurz
چکیده

A proposal in a weighted voting game is accepted if the sum of the (non-negative) weights of the “yea” voters is at least as large as a given quota. Several authors have considered representations of weighted voting games with minimum sum, where the weights and the quota are restricted to be integers. In [Freixas and Molinero(2009)] the authors have classified all weighted voting games without a unique minimum sum representation for up to 8 voters. Here we exhaustively classify all weighted voting games consisting of 9 voters which do not admit a unique minimum sum integer weight representation.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Boolean combinations of weighted voting games

Weighted voting games are a natural and practically important class of simple coalitional games, in which each agent is assigned a numeric weight, and a coalition is deemed to be winning if the sum of weights of agents in that coalition meets some stated threshold. We study a natural generalisation of weighted voting games called Boolean Weighted Voting Games (BWVGs). BWVGs are intended to mode...

متن کامل

Combinatorial and computational aspects of multiple weighted voting games

Weighted voting games are ubiquitous mathematical models which are used in economics, political science, neuroscience, threshold logic, reliability theory and distributed systems. They model situations where agents with variable voting weight vote in favour of or against a decision. A coalition of agents is winning if and only if the sum of weights of the coalition exceeds or equals a specified...

متن کامل

Complexity of comparison of influence of players in simple games

Coalitional voting games appear in different forms in multi-agent systems, social choice and threshold logic. In this paper, the complexity of comparison of influence between players in coalitional voting games is characterized. The possible representations of simple games considered are simple games represented by winning coalitions, minimal winning coalitions, weighted voting game or a multip...

متن کامل

The cost of principles: analyzing power in compatibility weighted voting games

We propose Compatibility Weighted Voting Games, a variant of Weighted Voting Games in which some pairs of agents are compatible and some are not. In a Weighted Voting Game each agent has a weight, and a set of agents can form a winning coalition if the sum of their weights is at least a given quota. Whereas the original Weighted Voting Game model assumes that all agents are compatible, we consi...

متن کامل

On the Design and Synthesis of Voting Games

In many real-world decision making settings, situations arise in which the parties (or: players) involved must collectively make decisions while not every player is supposed to have an equal amount of influence in the outcome of such a decision. The weighted voting game is a model that is often used to make such decisions. The amount of influence that a player has in a weighted voting game can ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Annals OR

دوره 196  شماره 

صفحات  -

تاریخ انتشار 2012